A New Solution for 7x7 Hex Game
نویسندگان
چکیده
Abstract. In this paper, we applied the decomposition method to obtain a new winning strategy for 7x7 Hex game. We also find that some positions on the 7x7 Hex board, which are called “trivial positions”, were never occupied by Black among all of strategies in the new solution. In other words, Black can still win the game by using the strategies described in this paper even if White already has pieces on those positions. Considering the symmetry properties of a Hex board for both players, we derived 14 losing positions on a 7x7 Hex board for Black’s first move.
منابع مشابه
Solving 7x7 Hex: Virtual Connections and Game-State Reduction
We present an algorithm which determines the outcome of an arbitrary Hex game-state by finding a winning virtual connection for the winning player. Our algorithm performs a recursive descent search of the game-tree, combining fixed and dynamic game-state virtual connection composition rules with some new Hex game-state reduction results based on move domination. The algorithm is powerful enough...
متن کاملA Move Generating Algorithm for Hex Solvers
Generating good move orderings when searching for solutions to games can greatly increase the efficiency of game solving searches. This paper proposes a move generating algorithm for the board game called Hex, which in contrast to many other approaches, determines move orderings from knowledge gained during the search. This move generator has been used in Hex searches solving the 6x6 Hex board ...
متن کاملSolving 7 7 Hex: Virtual Connections and Game-state Reduction
We present an algorithm which determines the outcome of an arbitrary Hex game-state by finding a winning virtual connection for the winning player. Our algorithm performs a recursive descent search of the game-tree, combining fixed and dynamic game-state virtual connection composition rules with some new Hex game-state reduction results based on move domination. The algorithm is powerful enough...
متن کاملHexGraph: Applying Graph Drawing Algorithms to the Game of Hex
Hex is a classic board game for two players. There exists an intuitive mapping of the state of a hex game onto a graph. The motivation of the work presented in this paper was to create a new user interface paradigm for playing Hex, which is based on the graph representation of the state of the game, and which increases the player’s ability to find good moves/strategies. The paradigm uses graph ...
متن کاملThe Game of Hex: An Automatic Theorem Proving Approach to Game Programming
The game of Hex is a two-player game with simple rules, a deep underlying mathematical beauty, and a strategic complexity comparable to that of Chess and Go. The massive game-tree search techniques developed mostly for Chess, and successfully used for Checkers, Othello, and a number of other games, become less useful for games with large branching factors like Go and Hex. We offer a new approac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002